A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
نویسندگان
چکیده
منابع مشابه
A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration
We describe a subdivision algorithm for isolating the complex roots of a polynomial F ∈ C[x]. Our model assumes that each coefficient of F has an oracle to return an approximation to any absolute error bound. Given any box B in the complex plane containing only simple roots of F , our algorithm returns disjoint isolating disks for the roots in B. Our complexity analysis bounds the absolute erro...
متن کاملdeveloping a pattern based on speech acts and language functions for developing materials for the course “ the study of islamic texts translation”
هدف پژوهش حاضر ارائه ی الگویی بر اساس کنش گفتار و کارکرد زبان برای تدوین مطالب درس "بررسی آثار ترجمه شده ی اسلامی" می باشد. در الگوی جدید، جهت تدوین مطالب بهتر و جذاب تر، بر خلاف کتاب-های موجود، از مدل های سطوح گفتارِ آستین (1962)، گروه بندی عملکردهای گفتارِ سرل (1976) و کارکرد زبانیِ هالیدی (1978) بهره جسته شده است. برای این منظور، 57 آیه ی شریفه، به صورت تصادفی از بخش-های مختلف قرآن انتخاب گردید...
15 صفحه اولthe relationship between eq, iq and test format: a study on test fairness
the major aim of this study was to investigate the relationship between iq, eq and test format in the light of test fairness considerations. this study took this relationship into account to see if people with different eq and iq performed differently on different test formats. to this end, 90 advanced learners of english form college of ferdowsi university of mashhad were chosen. they were ask...
15 صفحه اولCertified Complex Root Isolation by Subdivision and Modular Computation
We address the problem of root isolation for polynomial systems: for an affine, zero-dimensional polynomial system of N equations in N variables, we describe an algorithm to encapsulate all complex solutions into disjoint regions, each containing precisely one solution. Our approach also computes the multiplicity of each solution. The regions are computed by a simple subdivision method. Their i...
متن کاملa stable coupled newton's iteration for the matrix inverse $p$-th root
the computation of the inverse roots of matrices arises in evaluating non-symmetriceigenvalue problems, solving nonlinear matrix equations, computing some matrixfunctions, control theory and several other areas of applications. it is possible toapproximate the matrix inverse pth roots by exploiting a specialized version of new-ton's method, but previous researchers have mentioned that some...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2018
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2017.03.009